:-set(maximum_proof_depth, 10).
:-set(maximum_proof_unifications, 500).

:-set(maximum_literals_in_hypothesis, 6).

:-modeh(fib(+int/N,-int),[N>1]). %N>1 is the pre condition
:-modeb(2, pred(+int,-int)).
:-modeb(2, fib(+int,-int)).
:-modeb(plus(+int,+int,-int), commutative).

pred(N, M):- M is N-1.
%pred(N, M):- N>=0, M is N-1.
plus(A, B, C):- C is A+B.
fib(N, N):- N=<1.

:- set(example_inflation, 10).

% we just need two examples to learn the fibonnaci series concept

%example(fib(2,1), 1).
%example(fib(3,2), 1).
%example(fib(4,3), 1).
example(fib(5,5), 1).
%example(fib(6,8), 1).
example(fib(7,13), 1).
%example(fib(8,21), 1).

